Remarks on a family of permutation polynomials
نویسنده
چکیده
We study a family of permutations of the finite field Fqn given by x + γ f(x), where γ ∈ Fqn and f : Fqn → Fq. In particular, we determine the cycle structure and the inverse of such a permutation.
منابع مشابه
Remarks on Self-Inverse Quadratic Permutation Polynomials
Conditions for a quadratic permutation polynomial (QPP) to be self-inverse over the ring Zm of modular integers are given. If m = 2n, necessary and sufficient conditions for a QPP to be self-inverse are determined. Additional properties of QPP over modular integers as well as examples of monomial permutation polynomials are also provided. Mathematics Subject Classification: 12E10, 11B83
متن کاملLarge Families of Pseudorandom Subsets Formed by Power Residues
In an earlier paper the authors introduced the measures of pseudorandomness of subsets of the set of the positive integers not exceeding N , and they also presented two examples for subsets possessing strong pseudorandom properties. One of these examples included permutation polynomials f(X) ∈ Fp[X] and d-powers in Fp. This construction is not of much practical use since very little is known on...
متن کاملSome Remarks on a Paper by L. Carlitz
We study a family of orthogonal polynomials which generalizes a sequence of polynomials considered by L. Carlitz. We show that they are a special case of the Sheffer polynomials and point out some interesting connections with certain Sobolev orthogonal polynomials.
متن کاملA family of exceptional polynomials in characteristic three
We present a family of indecomposable polynomials of non prime-power degree over the finite field of three elements which are permutation polynomials over infinitely many finite extensions of the field. The associated geometric monodromy groups are the simple groups PSL2(3 ), where k≥3 is odd. This realizes one of the few possibilities for such a family which remain following the deep work of F...
متن کاملFive Constructions of Permutation Polynomials over $\gf(q^2)$
Four recursive constructions of permutation polynomials over GF(q2) with those over GF(q) are developed and applied to a few famous classes of permutation polynomials. They produce infinitely many new permutation polynomials over GF(q2 l ) for any positive integer l with any given permutation polynomial over GF(q). A generic construction of permutation polynomials over GF(22m) with o-polynomial...
متن کامل